Computational aspects of multivariate polynomial interpolation
نویسنده
چکیده
The paper is concerned with the practical implementation of two methods to compute the solution of polynomial interpolation problems. In addition to a description of the implementation, practical results and several improvements will be discussed, focusing on speed and robustness of the algorithms under consideration.
منابع مشابه
Computational aspects of multivariate polynomial interpolation: Indexing the coefficients
An algorithm is derived for generating the information needed to pass efficiently between multiindices of neighboring degrees, of use in the construction and evaluation of interpolating polynomials and in the construction of good bases for polynomial ideals. short title: Indexing the coefficients of multivariate polynomials AMS (MOS) Subject Classifications: primary 41A05, 41A10, 41A63, 65D05, ...
متن کاملMEAN VALUE INTERPOLATION ON SPHERES
In this paper we consider multivariate Lagrange mean-value interpolation problem, where interpolation parameters are integrals over spheres. We have concentric spheres. Indeed, we consider the problem in three variables when it is not correct.
متن کاملAsymptotically Optimal Monte Carlo Sparse Multivariate Polynomial Interpolation Algorithms of Straight-Line Program
In this paper, we propose new deterministic interpolation algorithms and Monte Carlo interpolation algorithms for sparse multivariate polynomials represented by straight-line programs. Let f be an n-variate polynomial with a degree bound D and and term bound T . Our deterministic algorithms have better complexities than existing deterministic interpolation algorithms in most cases. Our Monte Ca...
متن کاملInterpolation points and interpolation formulae on the square
The problem of choosing " good " nodes on a given compact set is a central one in multivariate polynomial interpolation. Besides unisolvence, which is by no means an easy problem, for practical purposes one needs slow growth of the Lebesgue constant and computational efficiency. In this talk, we present new sets of nodes recently studied for polynomial interpolation on the square that are asymp...
متن کاملOn multivariate polynomials in Bernstein-Bézier form and tensor algebra
The Bernstein-Bézier representation of polynomials is a very useful tool in computer aided geometric design. In this paper we make use of (multilinear) tensors to describe and manipulate multivariate polynomials in their Bernstein-Bézier form. As application we consider Hermite interpolation with polynomials and splines.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Adv. Comput. Math.
دوره 3 شماره
صفحات -
تاریخ انتشار 1995